Applications of Byzantine agreement in database systems
نویسندگان
چکیده
منابع مشابه
P Systems and the Byzantine Agreement Radu
We first propose a modular framework for recursive composition of P systems. This modular approach provides encapsulation and information hiding, facilitating the design of P programs for complex algorithms. Using this framework, we developed a P program that solves the classical version of the Byzantine agreement problem, for N participants connected in a complete graph, according to the well ...
متن کاملP systems and the Byzantine agreement
We first propose a modular framework for recursive composition of P systems. This modular approach provides encapsulation and information hiding, facilitating the design of P programs for complex algorithms. Using this framework, we developed a P program that solves the classical version of the Byzantine agreement problem, for N participants connected in a complete graph, according to the well ...
متن کاملExtending Binary Byzantine Agreement to Multivalued Byzantine Agreement
The concern of this paper is a set of potentially faulty processes that engage in a distributed computation to agree on some piece of information. Each process enters the computation with an initial value. The computation returns a common result value to each correct process. If all correct processes begin the computation with identical initial values, then the result value equals the initial v...
متن کاملCapacity of Byzantine Agreement
Caveat: This report represents work-in-progress, and provides some of our early results on the topic. A more complete version of this report, with additional results not presented in this draft, and improved description of the algorithms and analysis, will be released later this year. This draft version contains known problems with clarity/readability and the descriptions are incomplete/impreci...
متن کاملVerifying Randomized Byzantine Agreement
Distributed systems increasingly rely on fault-tolerant and secure authorization services. An essential primitive used to implement such services is the Byzantine agreement protocol for achieving agreement among n parties even if t parties (t < n/3) are corrupt and behave maliciously. We describe our experience verifying the randomized protocol ABBA (Asynchronous Binary Byzantine Agreement) of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 1986
ISSN: 0362-5915,1557-4644
DOI: 10.1145/5236.5243